Engineering efficient metric indexes
نویسنده
چکیده
We give efficient algorithms and index data structures for range search in general metric spaces. We give a simple methods to make almost any existing algorithm memory adaptive, improving the search the more memory is available. For vector spaces and metric space of strings we show how several distances can be computed in bit-parallelly, in sequential computer, and use the result to improve the search performance. This method works especially well with approximate range queries. The experimental results show that we can obtain order of magnitude improvements over the existing methods.
منابع مشابه
An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index
The variants of similarity queries have been widely studied in recent decade, such as k-nearest neighbors (k-NN), range query, reverse nearest neighbors (RNN), an so on. Nowadays, the reverse furthest neighbor (RFN) query is attracting more attention because of its applicability. Given an object set O and a query object q, the RFN query retrieves the objects of O, which take q as their furthest...
متن کاملDetermination of Criticality Indexes in the Remanufacturing Process: A GERT-based Simulation Approach
In this paper one of the important “end of life options” (remanufacturing) has been analysed. Among the related studies surveyed the various remanufacturing aspects, less attention has been paid to the stochastic process routing. In this regard, a remanufacturing process routing with stochastic activities is modelled as a GERT network. One of the efficient ways to analyse a remanufacturing proc...
متن کاملEfficient metric for pupil-phase engineering.
Pupil-phase engineering is a design process in which pupil-phase masks are optimized for performance characteristics by minimizing a cost function. To reduce computational complexity for optimizing focal depth, a cost function based on the second derivative of the optical transfer function with respect to misfocus at the origin is proposed. Efficient formulas for computing this metric are deriv...
متن کاملRestructuring versus Non Restructuring Insertions in MDF Indexes
MDF tree is a data structure (index) that is used to speed up similarity searches in huge databases. To achieve its goal the indexes should exploit some property of the dissimilarity measure. MDF indexes assume that the dissimilarity measure can be viewed as a distance in a metric space. Moreover, in this framework is assumed that the distance is computationally very expensive and then, countin...
متن کاملA New Feature Selection and Feature Contrasting Approach Based on Quality Metric: Application to Efficient Classification of Complex Textual Data
Feature maximization is a cluster quality metric which favors clusters with maximum feature representation as regard to their associated data. This metric has already been successfully exploited, altogether, for defining unbiased clustering quality indexes, for efficient cluster labeling, as well as for substituting to distance in the clustering process, like in the IGNGF incremental clustering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 28 شماره
صفحات -
تاریخ انتشار 2007